General neighbour-distinguishing index of a graph
نویسندگان
چکیده
It is proved that edges of a graph G can be coloured using χ(G) + 2 colours so that any two adjacent vertices have distinct sets of colours of their incident edges. In the case of a bipartite graph three colours are sufficient.
منابع مشابه
On neighbour-distinguishing colourings from lists
Let G be a finite simple graph, let C be a set of colours (in this paper we shall always suppose C ⊆ N) and let f : E(G) → C be an edge colouring of G. The colour set of a vertex v ∈ V (G) with respect to f is the set Sf (v) of colours of edges incident to v. The colouring f is neighbour-distinguishing if it distinguishes any two adjacent vertices by their colour sets, i.e., Sf (u) 6= Sf (v) wh...
متن کاملOn Neighbor-Distinguishing Index of Planar Graphs
A proper edge colouring of a graph G without isolated edges is neighbour-distinguishing if any two adjacent vertices have distinct sets consisting of colours of their incident edges. The neighbour-distinguishing index of G is the minimum number ndi(G) of colours in a neighbour-distinguishing edge colouring of G. According to a conjecture by Zhang, Liu and Wang (2002), ndi(G) ≤ ∆(G) + 2 provided...
متن کاملEquitable neighbour-sum-distinguishing edge and total colourings
With any (not necessarily proper) edge k-colouring γ : E(G) −→ {1, . . . , k} of a graph G, one can associate a vertex colouring σγ given by σγ(v) = ∑ e∋v γ(e). A neighbour-sumdistinguishing edge k-colouring is an edge colouring whose associated vertex colouring is proper. The neighbour-sum-distinguishing index of a graph G is then the smallest k for which G admits a neighbour-sum-distinguishin...
متن کاملThe relationship between the distinguishing number and the distinguishing index with detection number of a graph
This article has no abstract.
متن کاملDistinguishing number and distinguishing index of natural and fractional powers of graphs
The distinguishing number (resp. index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (resp. edge labeling) with $d$ labels that is preserved only by a trivial automorphism. For any $n in mathbb{N}$, the $n$-subdivision of $G$ is a simple graph $G^{frac{1}{n}}$ which is constructed by replacing each edge of $G$ with a path of length $n$...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008